One generator $(1+u)$-quasi twisted codes over $F_2+uF_2$
نویسندگان
چکیده
This paper gives the minimum generating sets of three types of one generator (1 + u)-quasi twisted (QT) codes over F 2 + uF 2 , u 2 = 0. Moreover, it discusses the generating sets and the lower bounds on the minimum Lee distance of a special class of A 2 type one generator (1 + u)-QT codes. Some good (optimal or suboptimal) linear codes over F 2 are obtained by these types of one generator (1 + u)-QT codes.
منابع مشابه
New extremal binary self-dual codes of length 68 via short kharaghani array over f_2 + uf_2
In this work, new construction methods for self-dual codes are given. The methods use the short Kharaghani array and a variation of it. These are applicable to any commutative Frobenius ring. We apply the constructions over the ring F2 + uF2 and self-dual Type I [64, 32, 12]2-codes with various weight enumerators obtained as Gray images. By the use of an extension theorem for self-dual codes we...
متن کاملThe Structure of 1-Generator Quasi-Twisted Codes and New Linear Codes
One of the most important problems of coding theory is to construct codes with best possible minimum distances. Recently, quasi-cyclic (QC) codes have been proven to contain many such codes. In this paper, we consider quasi-twisted (QT) codes, which are generalizations of QC codes, and their structural properties and obtain new codes which improve minimum distances of best known linear codes ov...
متن کاملNew Construction of 2-Generator Quasi-Twisted Codes
— Quasi-twisted (QT) codes are a generalization of quasi-cyclic (QC) codes. Based on consta-cyclic simplex codes, a new explicit construction of a family of 2-generator quasi-twisted (QT) two-weight codes is presented. It is also shown that many codes in the family meet the Griesmer bound and therefore are length-optimal. codes are also obtained by the construction.
متن کاملLong quasi-polycyclic t-CIS codes
We study complementary information set codes of length tn and dimension n of order t called (t−CIS code for short). Quasi-cyclic and quasi-twisted tCIS codes are enumerated by using their concatenated structure. Asymptotic existence results are derived for one-generator and have co-index n by Artin’s conjecture for quasi cyclic and special case for quasi twisted. This shows that there are infin...
متن کاملSkew cyclic codes over $\mathbb{F}_{p}+u\mathbb{F}_{p}$
In this paper, we study skew cyclic codes with arbitrary length over the ring $R=\mathbb{F}_{p}+u\mathbb{F}_{p}$ where $p$ is an odd prime and $% u^{2}=0$. We characterize all skew cyclic codes of length $n$ as left $% R[x;\theta ]$-submodules of $R_{n}=R[x;\theta ]/\langle x^{n}-1\rangle $. We find all generator polynomials for these codes and describe their minimal spanning sets. Moreover, an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1307.0180 شماره
صفحات -
تاریخ انتشار 2013